Distributed and Flexible Workflow Coordination Using Defeasible Logic Programming

نویسندگان

  • Iyad Rahwan
  • Khaled Shaalan
چکیده

This is an exploration to foretell a future in which traditional approaches for developing workflow management systems can be supplanted by new techniques and emerging technologies. This thesis recommends sets of methodologies for performing multiagent-based distributed and flexible workflow systems. Its objective is to deal with some of the present issues in the traditional workflow system from the business point of view. This thesis proposes that the traditional design of workflow management systems (clientserver) could be replaced by a defeasible logic programming (DeLP) engine– based multiagent platform that is more flexible and can better replicate workflow’s distributed characteristics in the open environment. This thesis presents sets of technologies for enacting multiagent-based distributed and flexible workflow systems. Its purpose is to tackle some of the existing problems in the traditional workflow system from the business point of view. This thesis proposes that the conventional system architecture of workflow management systems (client-server) could be replaced by a defeasible logic programming (DeLP) engine–based multiagent platform that is more open and collaborative, and can better reflect workflow’s distributed features in the open environment. This system also eliminates the requirement for centralized workflow coordination and proposes to build a flexible and distributed workflow management system using a multiagent system on a java agent development (JADE) framework, where the workflow semantics and business logic are built using DeLP. The main outcome of this research is to provide approaches for utilizing defeasible logic programming methodologies in application development, especially in business applications, where DeLP can contribute much for the automation of business logic. Moreover, a multiagent system on a JADE framework helps to maximize the use of existing process models and tools for automation of business processes. The model implemented as part of this thesis confirms that a workflow framework using DeLP improves the adaptability and decentralization of workflow management.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Distributed Argumentation Framework using Defeasible Logic Programming ( Extended Version )

Defeasible Logic Programming (DeLP) by García and Simari is an approach to realise non-monotonic reasoning via dialectical argumentation. We extend their approach by explicitly supporting distributed entities in the argumentation process on a structural basis. This makes the modelling of distributed argumentation systems like a jury court by using DeLP techniques possible. In this framework pos...

متن کامل

A Distributed Argumentation Framework using Defeasible Logic Programming

Defeasible Logic Programming (DeLP) by García and Simari is an approach to realise non-monotonic reasoning via dialectical argumentation. We extend their approach by explicitly supporting distributed entities in the argumentation process on a structural basis. This makes the modelling of distributed argumentation systems like a jury court by using DeLP techniques possible. In this framework pos...

متن کامل

Annotated defeasible logic

Defeasible logics provide several linguistic features to support the expression of defeasible knowledge. There is also a wide variety of such logics, expressing different intuitions about defeasible reasoning. However, the logics can only combine in trivial ways. This limits their usefulness in contexts where different intuitions are at play in different aspects of a problem. In particular, in ...

متن کامل

Realizing Argumentation in Multi-agent Systems Using Defeasible Logic Programming

We describe a working multi-agent architecture based on Defeasible Logic Programming (DeLP) by Garcı́a and Simari where agents are engaged in an argumentation to reach a common conclusion. Due to the distributed approach personalities and opinions of the individual agents give rise to arguments and counterarguments concerning a particular query. We establish a sound theoretical framework of a sp...

متن کامل

Logic Programming with Defaults and Argumentation Theories

We define logic programs with defaults and argumentation theories, a new framework that unifies most of the earlier proposals for defeasible reasoning in logic programming. We present a model-theoretic semantics and study its reducibility and well-behavior properties. We use the framework as an elegant and flexible foundation to extend and improve upon Generalized Courteous Logic Programs (GCLP...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010